Comparisons of Improved Round Robin Algorithms

نویسندگان

  • Christopher McGuire
  • Jeonghwa Lee
چکیده

Many altered versions of the Round Robin CPU scheduling algorithm have been created to fix the shortcomings of the Standard Round Robin algorithm. When these improved Round Robin algorithms are first created, they are always compared to the Standard Round Robin algorithm to ensure that they provide an improvement over it. Occasionally, they are compared to one other improved Round Robin algorithm for comparison as well, however little work has been done to compare several of these algorithms simultaneously to observe which ones make the greatest improvements over the Standard Round Robin algorithm. This research seeks to answer this query by comparing five improved Round Robin algorithms. Keywords—Context Switch, Round Robin, Process, Scheduling Algorithm, Turnaround Time, Waiting Time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm

The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...

متن کامل

Prioritized Elastic Round Robin: An Efficient and Low-Latency Packet Scheduler with Improved Fairness

In emerging high-speed integrated-services packet-switched networks, fair packet scheduling algorithms in switches and routers will play a critical role in providing the Quality-ofService (QoS) guarantees required by real-time applications. Elastic Round Robin (ERR), a recently proposed scheduling discipline, is very efficient with an O(1) work complexity. In addition, it has superior fairness ...

متن کامل

Stable and Practical Scheduling Algorithms for High Speed Virtual Output Queuing Switches

High-performance input queued switches achieve good performance with low cost. However, with the appearance of optical techniques, the line rate is much higher than before. Scheduling algorithms require not only good performance in delay and stability but fast speed and simple implementation as well. A variety of scheduling algorithms for Virtual Output Queuing (VOQ) packet switch architecture ...

متن کامل

Comparisons of Packet Scheduling Algorithms for Fair Service Among Connections on the Internet

We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be provided for elastic applications sharing the link. Packet scheduling algorithms that we consider are FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis resul...

متن کامل

Comparative performance analysis of multi dynamic time quantum Round Robin(MDTQRR) algorithm with arrival time

CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms manifests that Round Robin Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. We have proposed an efficient technique in the process scheduling algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014